CSE 347 Class 4 Jeremy Buhler
نویسنده
چکیده
• Example: sort the projects P in some order p1 . . . pn. • Either pn is part of some optimal solution to P , or it isn’t. Let Π∗ be this (unknown) optimal solution. • Π∗ consists of the result of our first choice (i.e., either pn or nothing), combined with some subset Π′ of the remaining projects. • If pn is part Π∗, then Π′ must consist only of projects in P that do not conflict with P ; that is, Π′ ⊆ P ′ = {p ∈ P | p ∩ pn = ∅}. • If instead pn is not part Π∗, then Π′ is a subset of the remaining projects; that is, Π′ ⊆ P ′ = P − {pn}.
منابع مشابه
Lecture 6 The EM Algorithm , Mixture Models , and Motif
In a previous class, we discussed an algorithm for learning a probabilistic matrix model which describes a fixed-length motif in a set of sequences S : : : S over an alphabet A. This algorithm is one of a class of methods collectively known as expectation maximization, or EM. We will describe the general EM algorithm, then derive the motif-finding algorithm by applying EM to learn a specific pr...
متن کاملComputational Methods for Accelerated Discovery and Characterization of Genes in Emerging Model Organisms
........................................................................................................................................ ii Acknowledgments ..................................................................................................................... iv List of Tables ............................................................................................................
متن کاملPractical Approaches to Biological Network Discovery
....................................................................................................................... ii Acknowledgments ....................................................................................................... iii List of Tables .............................................................................................................. vii List of Figures .......
متن کامل